Counting labelled three-connected and homeomorphically irreducible two-connected graphs
نویسندگان
چکیده
منابع مشابه
Counting unlabelled three-connected and homeomorphically irreducible two-connected graphs
A graph will be assumed to be finite and unoriented, with no loops or multiple edges; if multiple edges are to be allowed, the term multigraph will be used. A graph or multigraph. will be called k-connected if at least k vertices and their incident edges must be removed to disconnect it (a complete graph is considered to be k-connected for any k). A block (respectively, multiblock) is a 2-conne...
متن کاملHomeomorphically Irreducible Spanning Trees in Locally Connected Graphs
A spanning tree T of a graph G is called a homeomorphically irreducible spanning tree (HIST) if T does not contain vertices of degree 2. A graph G is called locally connected if for every vertex v ∈ V (G), the subgraph induced by the neighborhood of v is connected. In this paper, we prove that every connected and locally connected graph with more than 3 vertices contains a HIST. Consequently, w...
متن کاملCounting connected graphs asymptotically
We find the asymptotic number of connected graphs with k vertices and k − 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the probabilistic method, analyzing breadth-first search on the random graph G(k, p) for an appropriate edge probability p. Central is analysis of a random walk with fixed beginning and end which is tilted to the left.
متن کاملTwo-connected graphs with prescribed three-connected components
We adapt the classical 3-decomposition of any 2-connected graph to the case of simple graphs (no loops or multiple edges). By analogy with the block-cutpoint tree of a connected graph, we deduce from this decomposition a bicolored tree tc(g) associated with any 2-connected graph g, whose white vertices are the 3-components of g (3-connected components or polygons) and whose black vertices are b...
متن کاملHomeomorphically Irreducible Spanning Trees, Halin Graphs, and Long Cycles in 3-connected Graphs with Bounded Maximum Degrees
A tree T with no vertex of degree 2 is called a homeomorphically irreducible tree (HIT) and if T is spanning in a graph, then T is called a homeomorphically irreducible spanning tree (HIST). Albertson, Berman, Hutchinson and Thomassen asked if every triangulation of at least 4 vertices has a HIST and if every connected graph with each edge in at least two triangles contains a HIST. These two qu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1982
ISSN: 0095-8956
DOI: 10.1016/0095-8956(82)90072-7